Infeasibility of instance compression and succinct PCPs for NP
نویسندگان
چکیده
منابع مشابه
Succinct Proofs for NP and Spooky Interactions
This paper investigates the possibility that any NP statement can be proven by an argument system in two rounds of communication (i.e. one message from the verifier to the prover and one message back) while sending only relatively few bits, without relying on the existence of a random oracle. More specifically, we focus on a natural approach (suggested in [1]) for designing such an argument sys...
متن کاملQuadratic Span Programs and Succinct NIZKs without PCPs
We introduce a new characterization of the NP complexity class, called Quadratic Span Programs (QSPs), which is a natural extension of span programs defined by Karchmer and Wigderson. Our main motivation is the quick construction of succinct, easily verified arguments for NP statements. To achieve this goal, QSPs use a new approach to the well-known technique of arithmetization of Boolean circu...
متن کاملA Succinct Grammar Compression
We solve an open problem related to an optimal encoding of a straight line program (SLP), a canonical form of grammar compression deriving a single string deterministically. We show that an informationtheoretic lower bound for representing an SLP with n symbols requires at least 2n + log n! + o(n) bits. We then present a succinct representation of an SLP; this representation is asymptotically e...
متن کاملSuccinct NP Proofs from an Extractability Assumption
We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a message to the verifier) argument system (that is, a proof system where soundness holds against polynomial-time provers) with communication complexity only polylogarithmic in the size of the NP instance. We also show formal evid...
متن کاملA Tight Characterization of NP with 3 Query PCPs
It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a one-sided error that is bounded away from 1; and also that 2 queries do not suffice for such a characterization. Thus PCPs with 3 queries possess non-trivial verification power and motivate the task of determining the lowest error that can be achieved with a 3-query PCP. Recently, Håstad [11]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2011
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2010.06.007